home *** CD-ROM | disk | FTP | other *** search
- Path: howland.reston.ans.net!psinntp!psinntp!psinntp!psinntp!usenet
- From: grantp@usa.pipeline.com(Pete Grant)
- Newsgroups: comp.lang.c++
- Subject: Re: NEWBIE : Quicksort
- Date: 26 Mar 1996 11:31:50 GMT
- Organization: Kalevi, Inc.
- Message-ID: <4j8kj6$km0@news1.h1.usa.pipeline.com>
- References: <Pine.SOL.3.91.960325221334.202B-100000@orion>
- NNTP-Posting-Host: 38.8.120.18
- X-PipeUser: grantp
- X-PipeHub: usa.pipeline.com
- X-PipeGCOS: (Pete Grant)
- X-Newsreader: Pipeline v3.5.0
-
- On Mar 25, 1996 22:21:49 in article <Re: NEWBIE : Quicksort>, 'FRANCO
- <c2eyf931@sfsu.edu>' wrote:
-
-
- >On 25 Mar 1996, Pete Grant wrote:
- >
- >> int n = sizeof(z) / sizeof(int);
- >> qsort(z, n, sizeof(int), comp);
- >> for (int i = 0; i < n; i++)
- >> cout << ' ' << z[i];
- >
- >Pete,
- >
- >Can this be done without using qsort from the standard library <stdlib.h>?
-
- >
- Yes, but that's left as an exercise for the reader.
- (Homework?).
-
- --
- Pete Grant
- Kalevi, Inc.
- Software Engineering & development
-